Influence Maximization for Fixed Heterogeneous Thresholds
نویسندگان
چکیده
Influence Maximization is a NP-hard problem of selecting the optimal set of influencers in a network. Here, we propose two new approaches to influence maximization based on two very different metrics. The first metric, termed Balanced Index (BI), is fast to compute and assigns top values to two kinds of nodes: those with high resistance to adoption, and those with large out-degree. This is done by linearly combining three properties of a node: its degree, susceptibility to new opinions, and the impact its activation will have on its neighborhood. Controlling the weights between those three terms has a huge impact on performance. The second metric, termed Group Performance Index (GPI), measures performance of each node as an initiator when it is a part of randomly selected initiator set. In each such selection, the score assigned to each teammate is inversely proportional to the number of initiators causing the desired spread. These two metrics are applicable to various cascade models; here we test them on the Linear Threshold Model with fixed and known thresholds. Furthermore, we study the impact of network degree assortativity and threshold distribution on the cascade size for metrics including ours. The results demonstrate our two metrics deliver strong performance for influence maximization.
منابع مشابه
Influence Maximization Across Partially Aligned Heterogenous Social Networks
The influence maximization problem aims at finding a subset of seed users who can maximize the spread of influence in online social networks (OSNs). Existing works mostly focus on one single homogenous network. However, in the real world, OSNs (1) are usually heterogeneous, via which users can influence each others in multiple channels; and (2) share common users, via whom information could pro...
متن کاملAn efficient Imperialistic Competitive Algorithm for the closed-loop supply chains considering pricing for product, and fleet of heterogeneous vehicles
This paper investigates a pricing multi-period, closed-loop supply chains (CLSCs) with two echelons of producers and customers. Products are delivered to customers might be defective which are picked up and gathered in the collection center and will be fixed if it is possible and will be returned to the chain. Otherwise, they are sold as waste. This problem is determining price and distributio...
متن کاملMultiplex Influence Maximization in Online Social Networks with Heterogeneous Diffusion Models
Motivated by online social networks that are linked together through overlapping users, we study the influence maximization problem on a multiplex, with each layer endowed with its own model of influence diffusion. This problem is a novel version of the influence maximization problem that necessitates new analysis incorporating the type of propagation on each layer of the multiplex. We identify...
متن کاملThe complexity of finding harmless individuals in social networks
In this paper, we introduce a domination-related problem called Harmless Set: given a graph G = (V,E), a threshold function t : V → N and an integer k, find a subset of vertices V ′ ⊆ V of size at least k such that every vertex v in V has less than t(v) neighbors in V ′. We study its parameterized complexity and the approximation of the associated maximization problem. When the parameter is k, ...
متن کاملBeyond Worst-Case (In)approximability of Nonsubmodular Influence Maximization
We consider the problem of maximizing the spread of influence in a social network by choosing a fixed number of initial seeds, formally referred to as the influence maximization problem. It admits a (1 − 1/e)-factor approximation algorithm if the influence function is submodular. Otherwise, in the worst case, the problem is NP-hard to approximate to within a factor of N1−ε. This paper studies w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018